Short communication Approximate merging of multiple Bézier segments
نویسندگان
چکیده
This paper deals with the approximate merging problem of multiple adjacent Bézier curves with different degrees by a single Bézier curve, which is a frequently seen problem in modeling. The unified matrix representation for precise merging is presented and the approximate merging curve is further derived based on matrix operation. Continuity at the endpoints of curves is also discussed in the merging process. Examples show that the method in this paper achieves satisfying merging results. 2008 National Natural Science Foundation of China and Chinese Academy of Sciences. Published by Elsevier Limited and Science in China Press. All rights reserved.
منابع مشابه
Approximate merging of multiple Bézier segments
This paper deals with the approximate merging problem of multiple adjacent Bézier curves with different degrees by a single Bézier curve, which is a frequently seen problem in modeling. The unified matrix representation for precise merging is presented and the approximate merging curve is further derived based on matrix operation. Continuity at the endpoints of curves is also discussed in the m...
متن کاملTarget setting in the process of merging and restructuring of decision-making units using multiple objective linear programming
This paper presents a novel approach to achieving the goals of data envelopment analysis in the process of reconstruction and integration of decision-making units by using multiple objective linear programming. In this regard, first, we review inverse data envelopment analysis models for data reconstruction and integration. We present a model with multi-objective linear programming structure in...
متن کاملMerging DMUs Based on of the idea Inverse DEA
In this paper, we propose a novel method using multiple-objective programming problems to answer the following question: if among a group of decision making units (DMUs), a subset of DMUs are required to merge and form a new DMU with specific input/output levels and a predefined efficiency target, how much should be the outputs/inputs of the merged DMU? This question answered according to the c...
متن کاملEffective CG-merging of Two Bézier Curves by Matrix Computation
The merging of polynomial curves is frequently required when modeling the complex shape in geometric design and related applications. In this paper, we present an effective method for the CGmerging of two Bézier curves by using matrix computation. By minimizing the distance function defined in terms of control points, the optimal merged curve is obtained and expressed in the matrix form. Due to...
متن کاملA Fast and Robust Ellipse-Detection Method Based on Sorted Merging
A fast and robust ellipse-detection method based on sorted merging is proposed in this paper. This method first represents the edge bitmap approximately with a set of line segments and then gradually merges the line segments into elliptical arcs and ellipses. To achieve high accuracy, a sorted merging strategy is proposed: the merging degrees of line segments/elliptical arcs are estimated, and ...
متن کامل